Continuous Route Planning over a Dynamic Graph in Real-Time
نویسندگان
چکیده
منابع مشابه
Robust algorithm for real-time route planning
Route planning is an important problem for a number of diverse applications including intelligent transportation systems, space applications, autonomous robotics, and military guidance and navigation systems [1, 4, 5, 9—11]. We address the routing problem in the context of route planning for aircraft (rotorcraft or fixed-wing, manned or unmanned), though our approach can be easily extended to t...
متن کاملRoute Planning with Real-Time Traffic Predictions
Situation dependent route planning gathers increasing interest as cities become crowded and jammed. We present a system for individual trip planning that incorporates future traffic hazards in routing. Future traffic conditions are computed by a Spatio-Temporal Random Field based on a stream of sensor readings. In addition, our approach estimates traffic flow in areas with low sensor coverage u...
متن کاملA real time data streaming approach to best route planning
This paper describes our experience in building a framework designed for road conditions prediction. The proposed framework was made up by configuration and control panels based on web technologies, an engine for road conditions prediction based on stream processing paradigms, and a multimodal message delivery service which provides the user with multiple modes (SMS, MMS or email) of receiving ...
متن کاملA real-time recursive dynamic model for vehicle driving simulators
This paper presents the Real-Time Recursive Dynamics (RTRD) model that is developed for driving simulators. The model could be implemented in the Driving Simulator. The RTRD can also be used for off-line high-speed dynamics analysis, compared with commercial multibody dynamics codes, to speed up mechanical design process. An overview of RTRD is presented in the paper. Basic models for specific ...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2020
ISSN: 1877-0509
DOI: 10.1016/j.procs.2020.06.065